Computing Girth and Cogirth in Perturbed Graphic Matroids
نویسندگان
چکیده
We give efficient randomized algorithms for computing the girth and the cogirth of binary matroids that are low-rank perturbations of graphic matroids.
منابع مشابه
On the (co)girth of connected matroids ?
This article studies the girth and cogirth problems for connected matroids. The problem of finding the cogirth of a graphic matroid has been intensively studied, but studies on the equivalent problem for a linear matroid or a general matroid have been rarely reported. Based on the duality and connectivity of a matroid, we prove properties associated with the girth and cogirth of a matroid whose...
متن کاملOn the (co)girth of a connected matroid
This article studies the girth and cogirth problems for a connected matroid. The problem of finding the cogirth of a graphic matroid has been intensively studied, but studies on the equivalent problem for a vector matroid or a general matroid have been rarely reported. Based on the duality and connectivity of a matroid, we prove properties associated with the girth and cogirth of a matroid whos...
متن کاملComputing the minimum cut in hypergraphic matroids
Hypergraphic matroids were de ned by Lorea as generalizations of graphic matroids. We show that the minimum cut (co-girth) of a multiple of a hypergraphic matroid can be computed in polynomial time. It is well-known that the size of the minimum cut (co-girth) of a graph can be computed in polynomial time. For connected graphs, this is equivalent to computing the co-girth of the circuit matroid....
متن کاملSpanning cycles in regular matroids without M*(K5) minors
Catlin and Jaeger proved that the cycle matroid of a 4-edge-connected graph has a spanning cycle. This result can not be generalized to regular matroids as there exist infinitely many connected cographic matroids, each of which contains a M(K5) minor and has arbitrarily large cogirth, that do not have spanning cycles. In this paper, we proved that if a connected regular matroid without aM(K5)-m...
متن کاملOn packing spanning trees in graphs and bases in matroids
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We provide structural descriptions of such graphs and matroids. In the case of graphs, our results are relevant for certain communication protocols.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 38 شماره
صفحات -
تاریخ انتشار 2018